On Stable Cutsets in Claw-Free Graphs and Planar Graphs

نویسندگان

  • Van Bang Le
  • Raffaele Mosca
  • Haiko Müller
چکیده

A stable cutset in a connected graph is a stable set whose deletion disconnects the graph. Let K4 and K1,3 (claw) denote the complete (bipartite) graph on 4 and 1+ 3 vertices. It is NP-complete to decide whether a line graph (hence a claw-free graph) with maximum degree five or a K4-free graph admits a stable cutset. Here we describe algorithms deciding in polynomial time whether a claw-free graph with maximum degree at most four or whether a (claw, K4)-free graph admits a stable cutset. As a by-product we obtain that the stable cutset problem is polynomially solvable for claw-free planar graphs, and also for planar line graphs. Thus, the computational complexity of the stable cutset problem is completely determined for claw-free graphs with respect to degree constraint, and for claw-free planar graphs. Moreover, we prove that the stable cutset problem remains NP-complete for K4-free planar graphs with maximum degree five. © 2008 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Claw-free graphs with complete closure

We study some properties of the closure concept in claw-free graphs that was introduced by the rst author. It is known that G is hamiltonian if and only if its closure is hamiltonian, but, on the other hand, there are innnite classes of non-pancyclic graphs with pancyclic closure. We show several structural properties of claw-free graphs with complete closure and their clique cutsets and, using...

متن کامل

On cycles in intersection graphs of rings

‎Let $R$ be a commutative ring with non-zero identity. ‎We describe all $C_3$‎- ‎and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. ‎Also, ‎we shall describe all complete, ‎regular and $n$-claw-free intersection graphs. ‎Finally, ‎we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...

متن کامل

Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs

We study methods of planarizing and acyclically coloring claw-free subcubic graphs. We give a polynomial-time algorithm that, given such a graph G, produces an independent set Q of at most n/6 vertices whose removal from G leaves an induced planar subgraph P (in fact, P has treewidth at most four). We further show the stronger result that in polynomial-time a set of at most n/6 edges can be ide...

متن کامل

On facets of stable set polytopes of claw-free graphs with stability number three

Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a breakthrough for the subclass of quasi-line graphs. As a consequence, every non-trivial facet of their stable set polytope is of the form k ∑ v∈V1 xv+(k+1) ∑ v∈V2 xv ≤ b for some positive integers k and b, and non-empty...

متن کامل

Circular Ones Matrices and the Stable Set Polytope of Quasi- ine Graphs

It is a long standing open problem to find an explicit description of the stable set polytope of claw-free graphs. Yet more than 20 years after the discovery of a polynomial algorithm for the maximum stable set problem for claw-free graphs, there is even no conjecture at hand today. Such a conjecture exists for the class of quasi-line graphs. This class of graphs is a proper superclass of line ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005